-
1 modulo-two addition
сложение (суммирование) по модулю два (по mod 2)Англо-русский словарь по компьютерной безопасности > modulo-two addition
-
2 modulo two addition
English-Russian dictionary of telecommunications > modulo two addition
-
3 bit-by-bit modulo-two addition
поразрядное (побитовое) сложение по mod 2Англо-русский словарь по компьютерной безопасности > bit-by-bit modulo-two addition
-
4 modulo two bitwise addition
поразрядное (побитовое) сложение по mod 2Англо-русский словарь по компьютерной безопасности > modulo two bitwise addition
-
5 addition
сложение, суммированиеАнгло-русский словарь по компьютерной безопасности > addition
-
6 сложение
* * *сложе́ние с.1. мат. additionосуществля́ть [производи́ть] сложе́ние, напр. двух чи́сел — take the sum of, e. g., two numbersсложе́ние осуществля́ется [произво́дится] на основа́нии, напр. сочета́тельного зако́на — addition proceeds by use of, e. g., associative properties2. (сигналов, сил и т. п.) compositionсложе́ние вероя́тностей — composition of probabilitiesсложе́ние волн — wave interferenceсложе́ние вычита́нием — addition by subtractionгеометри́ческое сложе́ние — vectorial additionсложе́ние движе́ний — composition of motionsлоги́ческое сложе́ние — logical additionсложе́ние по мо́дулю N — modulo N additionпроизводи́ть сложе́ние по мо́дулю, напр. 2 — take the modulo, e. g., 2 sum of …, take the sum modulo, e. g., 2 of …, form the modulo, e. g., 2 sum of …сложе́ние сил — composition of forces -
7 non-equivalentie
• addition without carry• exclusive-or operation• modulo two sum• non-equivalence -
8 схема логического сложения
Русско-английский большой базовый словарь > схема логического сложения
-
9 adder
сумматор, суммирующее устройство- algebraic adder
- amplitude adder
- analog adder
- anticipated carry adder
- binary adder
- carry-look-ahead adder
- coincidence-type adder
- counter-type adder
- decimal adder
- differential gear adder
- digital adder
- exponent adder
- fast adder
- fetch-ahead adder
- floating point adder
- full adder
- half adder
- hard adder
- high-speed adder
- left-hand adder
- look-ahead carry adder
- matrix adder
- modulo-two adder
- N-channel adder
- nonalgebraic adder
- number adder
- one-column adder
- one-digit adder
- parallel adder
- pipeline adder
- pulse-bucking adder
- right-hand adder
- ripple-carry adder
- serial adder
- serial-parallel adder
- single-digit adder
- soft adder
- ternary adder
- three-input adder
- two-input adderEnglish-Russian dictionary of computer science and programming > adder
-
10 сложение
осуществлять (производить) сложение чего-л. по модулю N — take the modulo N sum of smth
См. также в других словарях:
Addition — is the mathematical process of putting things together. The plus sign + means that two numbers are added together. For example, in the picture on the right, there are 3 + 2 apples meaning three apples and two other apples which is the same as… … Wikipedia
Two's complement — The two s complement of a binary number is defined as the value obtained by subtracting the number from a large power of two (specifically, from 2 N for an N bit two s complement).A two s complement system or two s complement arithmetic is a… … Wikipedia
Modulo (jargon) — The word modulo (Latin, with respect to a modulus of ) is the Latin ablative of modulus which itself means a small measure. It was introduced into mathematics in the book Disquisitiones Arithmeticae by Carl Friedrich Gauss in 1801. Ever since,… … Wikipedia
Arithmétique modulo — Arithmétique modulaire Couverture de l’édition originale des Recherches arithmétiques de Gauss, livre fondateur de l’arithmétique modulaire. En mathématiques et plus précisément en théorie algébrique des nombres, l’arithmétique modulaire est un… … Wikipédia en Français
Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… … Wikipedia
Differential equations of addition — In cryptography, differential equations of addition (DEA) are one of the most basic equations related to differential cryptanalysis that mix additions over two different groups (e.g. addition modulo 232 and addition over GF(2)) and where input… … Wikipedia
Satisfiability Modulo Theories — (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first order logic with equality. Examples of theories typically used in computer science are the theory of real… … Wikipedia
Scrambler — For other uses, see Scrambler (disambiguation). In telecommunications, a scrambler is a device that transposes or inverts signals or otherwise encodes a message at the transmitter to make the message unintelligible at a receiver not equipped with … Wikipedia
Cover (telecommunications) — In telecommunications, cover is the technique of concealing or altering the characteristics of communications patterns for the purpose of denying an unauthorized receiver information that would be of value. The purpose of cover is not to make the … Wikipedia
Format-preserving encryption — In cryptography, format preserving encryption (FPE) refers to encrypting in such a way that the output (the ciphertext) is in the same format as the input (the plaintext). The meaning of format varies. Typically only finite domains are discussed … Wikipedia
Computation of CRC — Computation of a cyclic redundancy check is derived from the mathematics of polynomial division, modulo two. In practice, it resembles long division of the binary message string, with a fixed number of zeroes appended, by the generator polynomial … Wikipedia